Performance Bounds for Sparsity Pattern Recovery With Quantized Noisy Random Projections
نویسندگان
چکیده
منابع مشابه
A Sharp Sufficient Condition for Sparsity Pattern Recovery
Sufficient number of linear and noisy measurements for exact and approximate sparsity pattern/support set recovery in the high dimensional setting is derived. Although this problem as been addressed in the recent literature, there is still considerable gaps between those results and the exact limits of the perfect support set recovery. To reduce this gap, in this paper, the sufficient con...
متن کاملEfficient Sparsity Pattern Recovery
The theory of compressed sensing shows that sparsity pattern (or support) of a sparse signal can be recovered from a small number of appropriate linear projections (samples). Unfortunately, as soon as noise is added, the number of required samples exceeds the full signal dimension, rendering compressed sensing ineffective. In recent work, we have shown that this can be fixed if a small distorti...
متن کاملSignal sparsity estimation from compressive noisy projections via γ-sparsified random matrices
In this paper, we propose a method for estimating the sparsity of a signal from its noisy linear projections without recovering it. The method exploits the property that linear projections acquired using a sparse sensing matrix are distributed according to a mixture distribution whose parameters depend on the signal sparsity. Due to the complexity of the exact mixture model, we introduce an app...
متن کاملAn Estimation Theoretic Approach for Sparsity Pattern Recovery in the Noisy Setting
Compressed sensing deals with the reconstruction of sparse signals using a small number of linear measurements. One of the main challenges in compressed sensing is to find the support of a sparse signal. In the literature, several bounds on the scaling law of the number of measurements for successful support recovery have been derived where the main focus is on random Gaussian measurement matri...
متن کاملSharp thresholds for high-dimensional and noisy recovery of sparsity
The problem of consistently estimating the sparsity pattern of a vector β∗ ∈ R based on observations contaminated by noise arises in various contexts, including subset selection in regression, structure estimation in graphical models, sparse approximation, and signal denoising. We analyze the behavior of l1-constrained quadratic programming (QP), also referred to as the Lasso, for recovering th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal of Selected Topics in Signal Processing
سال: 2012
ISSN: 1932-4553,1941-0484
DOI: 10.1109/jstsp.2011.2175700